Efficient Retrieval on Dense Vector by Similarity Preserve Hash in Vegetable Geographical Origin Identification System
نویسندگان
چکیده
Recently, camouflaging geographical origin of agricultural products is a major problem in Japan. Therefore, we developed a distributed geographical origin identification system which identifies cultivated farms of vegetables by using trace element compositions of vegetables. This system stores compositions of trace, or very small quantities of elements into database which located on farming districts, and compares them to trace element compositions of vegetables which gathered from food distribution channel such as markets, food factories. The comparison is done by calculating correlation coefficient. This system can be considered as an information retrieval system which gives only an answer of which trace element composition is similar to given query vegetable’s trace element composition. In this system, trace element compositions are expressed as dense vector, and they are retrieved by one-to-one comparison. In this paper, we describe applying Similarity Preserve Hash (SPH) into our geographical origin identification system, with assumption on data disposition.
منابع مشابه
Deep Multi-label Hashing for Large-Scale Visual Search Based on Semantic Graph
Huge volumes of images are aggregated over time because many people upload their favorite images to various social websites such as Flickr and share them with their friends. Accordingly, visual search from large scale image databases is getting more and more important. Hashing is an efficient technique to large-scale visual content search, and learning-based hashing approaches have achieved gre...
متن کاملAdaptive hash retrieval with kernel based similarity
Indexing methods have been widely used for fast data retrieval on large scale datasets. When the data are represented by high dimensional vectors, hashing is often used as an efficient solution for approximate similarity search. When a retrieval task does not involve supervised training data, most hashing methods aim at preserving data similarity defined by a distance metric on the feature vect...
متن کاملSSDH: Semi-supervised Deep Hashing for Large Scale Image Retrieval
The hashing methods have been widely used for efficient similarity retrieval on large scale image datasets. The traditional hashing methods learn hash functions to generate binary codes from hand-crafted features, which achieve limited accuracy since the hand-crafted features cannot optimally represent the image content and preserve the semantic similarity. Recently, several deep hashing method...
متن کاملSupervised Hashing for Image Retrieval via Image Representation Learning
Hashing is a popular approximate nearest neighbor search approach for large-scale image retrieval. Supervised hashing, which incorporates similarity/dissimilarity information on entity pairs to improve the quality of hashing function learning, has recently received increasing attention. However, in the existing supervised hashing methods for images, an input image is usually encoded by a vector...
متن کاملDeep Hashing Network for Efficient Similarity Retrieval
Due to the storage and retrieval efficiency, hashing has been widely deployed to approximate nearest neighbor search for large-scale multimedia retrieval. Supervised hashing, which improves the quality of hash coding by exploiting the semantic similarity on data pairs, has received increasing attention recently. For most existing supervised hashing methods for image retrieval, an image is first...
متن کامل